Predictive control of periodic-review production inventory systems with deteriorating items

In this paper a predictive control strategy is applied to a periodic-review dynamic inventory system with deteriorating items. Given the current inventory level, we determine the optimal production rates to be implemented at the beginning of each of the following periods over the control horizon. The effectiveness of this approach is the use of future information of the inventory target level and the desired production rate, which are available, along the fixed horizon. The deterioration coefficient may be known or unknown and both cases are considered. In the case where it is unknown, the self-tuning predictive control is applied. The proposed control algorithms are illustrated by simulations.     

Ultrafast carrier dynamics in ferromagnetic InGaMnAs

We have carried out an ultrafast time-resolved differential reflectivity study of a ferromagnetic semiconductor InGaMnAs and made a systematic comparison with low-temperature grown and high-temperature grown InGaAs reference films. Very short carrier lifetimes (2 ps) were observed in InGaMnAs and the low-temperature grown InGaAs film, but not in the high-temperature grown InGaAs film. We attribute the short lifetimes to carrier trapping by mid-gap states introduced during low-temperature MBE growth. Furthermore, at long times, we observed periodic oscillations in the differential reflectivity signal with period 20 ps, which we interpret as coherent acoustic phonons.     

Protein Conformation of a Lattice Model Using Tabu Search

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.     

Direct laser ablation of sub-100 nm line structures into polyimide

Periodic line structures with a period of 167 nm and linewidths varying from 30 to 100 nm have been produced in polyimide by direct ablation with a KrF laser using an interferometric technique. The characteristics of this interferometer as it applies to the ablation of these line structures, including linewidth and alignment sensitivity, are analyzed. The ability to control the linewidth by varying the average incident fluence is described theoretically and demonstrated experimentally. This externally generated period of 167 nm also prevents the spontaneous growth of laser induced periodic surface structures (LIPSS).     

A tunable microwave notch absorber filter

A magnetized plasma column is found to be a notch absorber of microwave radiation propagating in the extraordinary mode. Based on this fact, a compact tunable microwave filter is designed and tested successfully. The center frequency of the absorbed band can be varied by adjusting the background magnetic field stength. The 3dB bandwidth and amount of attenuation are functions of the plasma current. These characteristics offer a great tunability, often sought after in microwave devices. This filter can find applications in microwave measurement systems where filtering of unwanted harmonics and spurious signals can directly affect the accuracy and resolution of the measurements.     

A simple formula for mean multiplexing delay for independent regenerative sources

Simple expressions are given for the mean delay, mean waiting time, and mean busy period length in a multiplexer. Data streams with active periods having a general distribution are permitted, and the data rate during the active periods can be random. Data can also arrive in batches. The key restrictions of the model are that the sources are independent, idle periods are exponentially distributed, and a source generates at least enough data during an active period to keep the server busy throughout the period. The exact formulas allow evaluation of the error in approximations such as a heavy traffic diffusion approximation.Both continuous and discrete time models are considered. The discrete-time model includes that studied by Viterbi and subsequently generalized by Neuts. The Pollaczek-Khinchine formula for the mean amount of work in anM/GI/1 queue is retrieved as a limiting case.Preliminary version presented at IEEE INFOCOM, San Francisco, April 1993.     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

Trefftz,collocation, and other boundary methods—A comparison

In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Some Fixed-Point Results for the Dynamic Assignment Problem

In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm.